A Simple Extension of the $\modulo$-$\Lambda$ Transformation
نویسندگان
چکیده
A simple lemma is derived that allows to transform a general scalar (non-Gaussian, non-additive) continuousalphabet channel as well as a general multiple-access channel into a modulo-additive noise channel. While in general the transformation is information lossy, it allows to leverage linear coding techniques and capacity results derived for networks comprised of additive Gaussian nodes to more general networks.
منابع مشابه
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedde...
متن کاملSmaran: A Congruence-Closure Based System for Equational Computations
p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...
متن کاملIsomorphisms considered as equalities: Projecting functions and enhancing partial application through and implementation of lambda+
We propose an implementation of λ + , a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of λ + is a rewrite system modulo an equivalence relation, which makes its implementation non-trivial. We also extend λ + with natural numbers and general recursion and use Beki´c's theorem to split mutual recursions. This splitting, toget...
متن کاملModels and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory
We define a notion of model for the λΠ-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the λΠ-calculus modulo any super-consistent theory. We prove this way the termination of proof reduction in several theories including Simple type theory and the Calculus of constructions.
متن کاملObjects and Subtyping in the λΠ-Calculus Modulo
We present a shallow embedding of the Object Calculus of Abadi and Cardelli in the λΠ-calculus modulo, an extension of the λΠ-calculus with rewriting. This embedding may be used as an example of translation of subtyping. We prove this embedding correct with respect to the operational semantics and the type system of the Object Calculus. We implemented a translation tool from the Object Calculus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0808.3959 شماره
صفحات -
تاریخ انتشار 2008